Routing in Networks with Random Topologies
نویسندگان
چکیده
AI IS’1’RAC’1’: We examine the problems of routing and server assignment in network with ranclom connectivities. In such a network the basic topology is fixed, but during each time slot ancl for each of its iw ~Jut queues, each server (node) is either connected to or disconnected from each of its input queues with some probability. I~uring each time slot a server must decide which of its connected input queues to serve and into which of its output queues the completed job should be placed.
منابع مشابه
An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملAn Empirical Study of Routing Bias in Variable-Degree Networks
Recent work on Internet measurement and topology characterization has revealed a feature sharply distinct from the early Erdős-Rényi random graph model: highly variable degree distributions which arguably follow power-laws. Such properties may significantly affect various network algorithms and protocols. This paper explores whether and how degree variability causes routing bias, a phenomenon t...
متن کاملBlocking in Wavelength Routing Networks , Part II : Mesh Topologies
We study a class of circuit switched wavelength routing networks with xed or alternate routing and with random wavelength allocation. We present an iterative path decomposition algorithm to evaluate accurately and e ciently the blocking performance of such networks with and without wavelength converters. The path decomposition approach naturally captures the correlation of both link loads and l...
متن کاملCharacterizing topological bottlenecks for data delivery in CTP using simulation-based stress testing with natural selection
Routing protocols for ad-hoc networks, e.g., the Collection Tree Protocol (CTP), are designed with simple node-local behaviour, but are deployed on testbeds with uncontrollable physical topology; exhaustively verifying the protocol on all possible topologies at design time is not tractable. We obtain topological insights on CTP performance, to answer the question: Which topological patterns cau...
متن کاملThe stellar transformation: From interconnection networks to datacenter networks
The first dual-port server-centric datacenter network, FiConn, was introduced in 2009 and there are several others now in existence; however, the pool of topologies to choose from remains small. We propose a new generic construction, the stellar transformation, that dramatically increases the size of this pool by facilitating the transformation of well-studied topologies from interconnection ne...
متن کاملNetwork Routing Using Zone Based Ant Colony Optimization in VANET
Vehicular Ad hoc Networks (VANET) exhibit highly dynamic behaviour with high mobility and random network topologies. The performance of Transmission Control Protocols (TCP) on such wireless ad hoc networks is plagued by a number of problems: link failures, scalability, multi-hop data transmission and data loss. In this work, we make use of the vehicle’s movement pattern, density, velocity and v...
متن کامل